0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.10/0.32	% Computer : n008.cluster.edu
0.10/0.32	% Model    : x86_64 x86_64
0.10/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory   : 8042.1875MB
0.10/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1920
0.10/0.32	% WCLimit    : 240
0.10/0.32	% DateTime   : Wed Jul 30 02:02:49 EDT 2025
0.10/0.32	% CPUTime    : 
0.18/0.47	Running higher-order theorem proving
0.18/0.52	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.WSwoRmPERk/E---3.1_17034.p
0.51/0.65	# Version: 3.0.0-ho
0.51/0.65	# Preprocessing class: HSLSSMSSSSMCHFA.
0.51/0.65	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.51/0.65	# Starting sh3 with 1200s (5) cores
0.51/0.65	# Starting new_bool_3 with 240s (1) cores
0.51/0.65	# Starting new_bool_1 with 240s (1) cores
0.51/0.65	# Starting new_bool_2 with 240s (1) cores
0.51/0.65	# new_bool_2 with pid 17148 completed with status 0
0.51/0.65	# Result found by new_bool_2
0.51/0.65	# Preprocessing class: HSLSSMSSSSMCHFA.
0.51/0.65	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.51/0.65	# Starting sh3 with 1200s (5) cores
0.51/0.65	# Starting new_bool_3 with 240s (1) cores
0.51/0.65	# Starting new_bool_1 with 240s (1) cores
0.51/0.65	# Starting new_bool_2 with 240s (1) cores
0.51/0.65	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.51/0.65	# Search class: HGHSM-FSLM33-DHFFFSBN
0.51/0.65	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
0.51/0.65	# Starting new_ho_10 with 145s (1) cores
0.51/0.65	# new_ho_10 with pid 17152 completed with status 0
0.51/0.65	# Result found by new_ho_10
0.51/0.65	# Preprocessing class: HSLSSMSSSSMCHFA.
0.51/0.65	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.51/0.65	# Starting sh3 with 1200s (5) cores
0.51/0.65	# Starting new_bool_3 with 240s (1) cores
0.51/0.65	# Starting new_bool_1 with 240s (1) cores
0.51/0.65	# Starting new_bool_2 with 240s (1) cores
0.51/0.65	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.51/0.65	# Search class: HGHSM-FSLM33-DHFFFSBN
0.51/0.65	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
0.51/0.65	# Starting new_ho_10 with 145s (1) cores
0.51/0.65	# Preprocessing time       : 0.013 s
0.51/0.65	# Presaturation interreduction done
0.51/0.65	
0.51/0.65	# Proof found!
0.51/0.65	# SZS status Theorem
0.51/0.65	# SZS output start CNFRefutation
0.51/0.65	thf(decl_sort1, type, hF_Mirabelle_hf: $tType).
0.51/0.65	thf(decl_43, type, hF_Mirabelle_hmem: hF_Mirabelle_hf > hF_Mirabelle_hf > $o).
0.51/0.65	thf(decl_50, type, ord_le976219883lle_hf: hF_Mirabelle_hf > hF_Mirabelle_hf > $o).
0.51/0.65	thf(decl_73, type, a: hF_Mirabelle_hf).
0.51/0.65	thf(decl_74, type, b: hF_Mirabelle_hf).
0.51/0.65	thf(decl_220, type, esk146_2: hF_Mirabelle_hf > hF_Mirabelle_hf > hF_Mirabelle_hf).
0.51/0.65	thf(fact_6_less__eq__hf__def, axiom, ((ord_le976219883lle_hf)=(^[X351:hF_Mirabelle_hf, X352:hF_Mirabelle_hf]:(![X353:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X353 @ X351)=>(hF_Mirabelle_hmem @ X353 @ X352)))))), file('/export/starexec/sandbox2/tmp/tmp.WSwoRmPERk/E---3.1_17034.p', fact_6_less__eq__hf__def)).
0.51/0.65	thf(conj_0, hypothesis, ![X23:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X23 @ b)<=(hF_Mirabelle_hmem @ X23 @ a))), file('/export/starexec/sandbox2/tmp/tmp.WSwoRmPERk/E---3.1_17034.p', conj_0)).
0.51/0.65	thf(conj_1, conjecture, (ord_le976219883lle_hf @ a @ b), file('/export/starexec/sandbox2/tmp/tmp.WSwoRmPERk/E---3.1_17034.p', conj_1)).
0.51/0.65	thf(c_0_3, plain, ((ord_le976219883lle_hf)=(^[Z0/* 19 */:hF_Mirabelle_hf, Z1:hF_Mirabelle_hf]:(![X353:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X353 @ Z0)=>(hF_Mirabelle_hmem @ X353 @ Z1)))))), inference(fof_simplification,[status(thm)],[fact_6_less__eq__hf__def])).
0.51/0.65	thf(c_0_4, hypothesis, ![X23:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X23 @ a)=>(hF_Mirabelle_hmem @ X23 @ b))), inference(fof_simplification,[status(thm)],[conj_0])).
0.51/0.65	thf(c_0_5, plain, ((ord_le976219883lle_hf)=(^[Z0/* 19 */:hF_Mirabelle_hf, Z1:hF_Mirabelle_hf]:(![X2102:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X2102 @ Z0)=>(hF_Mirabelle_hmem @ X2102 @ Z1)))))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.51/0.65	thf(c_0_6, hypothesis, ![X1304:hF_Mirabelle_hf]:((~(hF_Mirabelle_hmem @ X1304 @ a)|(hF_Mirabelle_hmem @ X1304 @ b))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
0.51/0.65	thf(c_0_7, plain, ![X2008:hF_Mirabelle_hf, X2009:hF_Mirabelle_hf]:((![X2103:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X2103 @ X2008)=>(hF_Mirabelle_hmem @ X2103 @ X2009)))<=>(ord_le976219883lle_hf @ X2008 @ X2009))), inference(arg_cong,[status(thm)],[c_0_5])).
0.51/0.65	thf(c_0_8, hypothesis, ![X3:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X3 @ b)|~((hF_Mirabelle_hmem @ X3 @ a)))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.51/0.65	thf(c_0_9, plain, ![X3:hF_Mirabelle_hf, X4:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ (esk146_2 @ X3 @ X4) @ X3)|(ord_le976219883lle_hf @ X3 @ X4))), inference(dynamic_cnf,[status(thm)],[c_0_7])).
0.51/0.65	thf(c_0_10, negated_conjecture, ~(ord_le976219883lle_hf @ a @ b), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])).
0.51/0.65	thf(c_0_11, plain, ![X3:hF_Mirabelle_hf, X4:hF_Mirabelle_hf]:(((ord_le976219883lle_hf @ X3 @ X4)|~((hF_Mirabelle_hmem @ (esk146_2 @ X3 @ X4) @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_7])).
0.51/0.65	thf(c_0_12, hypothesis, ![X3:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ (esk146_2 @ a @ X3) @ b)|(ord_le976219883lle_hf @ a @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.51/0.65	thf(c_0_13, negated_conjecture, ~((ord_le976219883lle_hf @ a @ b)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.51/0.65	thf(c_0_14, hypothesis, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13]), ['proof']).
0.51/0.65	# SZS output end CNFRefutation
0.51/0.65	# Parsed axioms                        : 406
0.51/0.65	# Removed by relevancy pruning/SinE    : 195
0.51/0.65	# Initial clauses                      : 508
0.51/0.65	# Removed in clause preprocessing      : 11
0.51/0.65	# Initial clauses in saturation        : 497
0.51/0.65	# Processed clauses                    : 838
0.51/0.65	# ...of these trivial                  : 12
0.51/0.65	# ...subsumed                          : 235
0.51/0.65	# ...remaining for further processing  : 591
0.51/0.65	# Other redundant clauses eliminated   : 90
0.51/0.65	# Clauses deleted for lack of memory   : 0
0.51/0.65	# Backward-subsumed                    : 0
0.51/0.65	# Backward-rewritten                   : 0
0.51/0.65	# Generated clauses                    : 680
0.51/0.65	# ...of the previous two non-redundant : 568
0.51/0.65	# ...aggressively subsumed             : 0
0.51/0.65	# Contextual simplify-reflections      : 3
0.51/0.65	# Paramodulations                      : 435
0.51/0.65	# Factorizations                       : 8
0.51/0.65	# NegExts                              : 0
0.51/0.65	# Equation resolutions                 : 90
0.51/0.65	# Disequality decompositions           : 0
0.51/0.65	# Total rewrite steps                  : 65
0.51/0.65	# ...of those cached                   : 42
0.51/0.65	# Propositional unsat checks           : 0
0.51/0.65	#    Propositional check models        : 0
0.51/0.65	#    Propositional check unsatisfiable : 0
0.51/0.65	#    Propositional clauses             : 0
0.51/0.65	#    Propositional clauses after purity: 0
0.51/0.65	#    Propositional unsat core size     : 0
0.51/0.65	#    Propositional preprocessing time  : 0.000
0.51/0.65	#    Propositional encoding time       : 0.000
0.51/0.65	#    Propositional solver time         : 0.000
0.51/0.65	#    Success case prop preproc time    : 0.000
0.51/0.65	#    Success case prop encoding time   : 0.000
0.51/0.65	#    Success case prop solver time     : 0.000
0.51/0.65	# Current number of processed clauses  : 163
0.51/0.65	#    Positive orientable unit clauses  : 56
0.51/0.65	#    Positive unorientable unit clauses: 0
0.51/0.65	#    Negative unit clauses             : 35
0.51/0.65	#    Non-unit-clauses                  : 72
0.51/0.65	# Current number of unprocessed clauses: 565
0.51/0.65	# ...number of literals in the above   : 2278
0.51/0.65	# Current number of archived formulas  : 0
0.51/0.65	# Current number of archived clauses   : 372
0.51/0.65	# Clause-clause subsumption calls (NU) : 35465
0.51/0.65	# Rec. Clause-clause subsumption calls : 7553
0.51/0.65	# Non-unit clause-clause subsumptions  : 209
0.51/0.65	# Unit Clause-clause subsumption calls : 1108
0.51/0.65	# Rewrite failures with RHS unbound    : 0
0.51/0.65	# BW rewrite match attempts            : 57
0.51/0.65	# BW rewrite match successes           : 0
0.51/0.65	# Condensation attempts                : 838
0.51/0.65	# Condensation successes               : 12
0.51/0.65	# Termbank termtop insertions          : 85532
0.51/0.65	# Search garbage collected termcells   : 11022
0.51/0.65	
0.51/0.65	# -------------------------------------------------
0.51/0.65	# User time                : 0.090 s
0.51/0.65	# System time              : 0.008 s
0.51/0.65	# Total time               : 0.098 s
0.51/0.65	# Maximum resident set size: 4532 pages
0.51/0.65	
0.51/0.65	# -------------------------------------------------
0.51/0.65	# User time                : 0.106 s
0.51/0.65	# System time              : 0.010 s
0.51/0.65	# Total time               : 0.116 s
0.51/0.65	# Maximum resident set size: 2700 pages
0.51/0.65	% E exiting
0.51/0.65	% E exiting
0.51/0.65	EOF